x . f x fprovided x does not occur as a free variableThis conversion is only valid if "> in f and f is a function. Left to right is eta reduction, right to left is eta abstraction (or eta expansion).This conversion is only valid if bottom and x . bottom are equivalent in all contexts. They are certainly equivalent when applied to some argument - they both fail to terminate. If we are allowed to force the evaluation of an expression in any other way, e.g. using {seq} in Miranda or returning a function as the overall result of a program, then bottom and See also "> x . bottom will not be equivalent.See also observational equivalence, reduction.reduction.……">

翻訳と辞書 Words near each other ・ espol ・ esprit ・ esr ・ essential complexity ・ estelle ・ esterel ・ estpc ・ et ・ et++ ・ eta abstraction ・ eta conversion ・ eta expansion ・ eta reduction ・ etb ・ etc ・ ether ・ ethergate ・ ethernet ・ ethernet address ・ ethernet meltdown Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク eta conversion ： FOLDOC eta conversion In lambda-calculus, the eta conversion rule states x . f x <--> f provided x does not occur as a free variable in f and f is a function. Left to right is eta reduction, right to left is eta abstraction (or eta expansion). This conversion is only valid if bottom and x . bottom are equivalent in all contexts. They are certainly equivalent when applied to some argument - they both fail to terminate. If we are allowed to force the evaluation of an expression in any other way, e.g. using {seq} in Miranda or returning a function as the overall result of a program, then bottom and x . bottom will not be equivalent. See also observational equivalence, reduction. reduction. スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.